Learning graph attention-aware knowledge graph embedding
نویسندگان
چکیده
The knowledge graph, which utilizes graph structure to represent multi-relational data, has been widely used in the reasoning and prediction tasks, attracting considerable research efforts recently. However, most existing works still concentrate on learning embeddings straightforwardly intuitively without subtly considering context of knowledge. Specifically, recent models deal with each single triple independently or consider contexts indiscriminately, is one-sided as unit (i.e., triple) can be derived from its partial surrounding triples. In this paper, we propose a graph-attention-based model encode entities, formulates an irregular explores number concrete interpretable compositions by integrating graph-structured information via multiple independent channels. To measure correlation between entities different angles entity pair, relation, structure), respectively develop three attention metrics. By making use our enhanced embeddings, further introduce several improved factorization functions for updating relation evaluating candidate We conduct extensive experiments downstream tasks including classification, typing, link validate methods. Empirical results importance introduced metrics demonstrate that proposed method improve performance large-scale graphs.
منابع مشابه
GAKE: Graph Aware Knowledge Embedding
Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable research efforts recently. Most existing approaches treat the given knowledge base as a set of triplets, each of whose representation is then learned separately. However, as a fact, triples are connected and depend on each other. In this paper, we propose a graph aware know...
متن کاملSemantically Smooth Knowledge Graph Embedding
This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...
متن کاملContext-Dependent Knowledge Graph Embedding
We consider the problem of embedding knowledge graphs (KGs) into continuous vector spaces. Existing methods can only deal with explicit relationships within each triple, i.e., local connectivity patterns, but cannot handle implicit relationships across different triples, i.e., contextual connectivity patterns. This paper proposes context-dependent KG embedding, a twostage scheme that takes into...
متن کاملActive Learning for Graph Embedding
Graph embedding provides an ecient solution for graph analysis by converting the graph into a low-dimensional space which preserves the structure information. In contrast to the graph structure data, the i.i.d. node embeddings can be processed eciently in terms of both time and space. Current semi-supervised graph embedding algorithms assume the labelled nodes are given, which may not be alwa...
متن کاملKnowledge Graph Embedding by Translating on Hyperplanes
We deal with embedding a large scale knowledge graph composed of entities and relations into a continuous vector space. TransE is a promising method proposed recently, which is very efficient while achieving state-of-the-art predictive performance. We discuss some mapping properties of relations which should be considered in embedding, such as reflexive, one-to-many, many-to-one, and many-to-ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2021
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2021.01.139